#include <iostream>
using namespace std;

// 求根号n的下界
int approx_root(double n)
{
    int i = 1;
    while (i * i <= n)
        i++;
    return i - 1;
}

int main()
{
    for (int i = 1; i <= 20; i++)
    {
        cout << i << "(" << approx_root(i) << ")\t";
        if (i % 5 == 0)
            cout << endl;
    }
    return 0;
}